The single-item lot-sizing problem with immediate lost sales

نویسندگان

  • Deniz Aksen
  • Kemal Altinkemer
  • Suresh Chand
چکیده

e introduce a profit maximization version of the well-known Wagner-Whitin model for the deterministic uncapacitated single-item lot-sizing problem with lost sales. Demand cannot be backlogged, but it does not have to be satisfied, either. Costs and selling prices are assumed to be time-variant, differentiating our model from previous models with lost sales. Production quantities and levels of lost sales in different periods represent a two-fold decision problem. We first transform the total profit function into a special total cost function. We then prove several properties of an optimal solution. A forward recursive dynamic programming algorithm is developed to solve the problem optimally in O(T ) time, where T denotes the number of periods in the problem horizon. The proposed algorithm can solve problems of sizes up to 400 periods in less than a second on a 500 MHz Pentium III processor. (Lot-Sizing; Dynamic Programming; Conservation Period; Profit) ∗ Corresponding author. Tel.: ++1-765-743-9552; Fax:++1-765-494-1526. E-mail address: [email protected] W THE SINGLE-ITEM LOT-SIZING PROBLEM WITH IMMEDIATE LOST SALES

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristics for the multi-item capacitated lot-sizing problem with lost sales

This paper deals with the multi-item capacitated lot-sizing problem with setup times and lost sales. Because lost sales, demands can be partially or totally lost. To find a good lower bound, we use a Lagrangian relaxation of the capacity constraints, when single-item uncapacitated lot-sizing problems with lost sales have to be solved. Each subproblem is solved using an adaptation of the O(T ) d...

متن کامل

Single item lot-sizing problem for a warm/cold process with immediate lost sales

We consider the dynamic lot-sizing problem with finite capacity and possible lost sales for a process that could be kept warm at a unit variable cost for the next period t + 1 only if more than a threshold value Qt has been produced and would be cold, otherwise. Production with a cold process incurs a fixed positive setup cost, Kt and setup time, St, which may be positive. Setup costs and times...

متن کامل

Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)

This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...

متن کامل

A Vibration Damping Optimization Algorithm for Solving the Single-item Capacitated Lot-sizing Problem with Fuzzy Parameters

In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...

متن کامل

A POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE

The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 147  شماره 

صفحات  -

تاریخ انتشار 2003